搜索资源列表
duanyuanzuiduan.rar
- 单源最短路径问题，分支限界法的优先队列解法，最小堆来存储活结点表，表示活结点优先队列，优先级是结点所对应的当前路长,Single-source shortest path problem, branch and bound method of the priority queue method, the smallest heap to store slipknot points table, said slipknot point priority queue, priority is the
Qkw_Fac6_8.rar
- 电路板排列问题的分支限界解法,,本程序取自王晓东编著“算法分析与设计”第 225 页，原程序不通，我调试已通过。 ,Circuit board with the issue of branch and bound method, this procedure from Xiaodong edited Algorithm Analysis and Design section 225, the original procedures for access, I have passed deb
DividePlane
- 运筹学中的分支定界法，采用MATLAB编程，比较实用-Operations research branch and bound method, using MATLAB programming, more practical
knapsack
- 0—1背包问题的五种解法 1贪心法 2动态规划 3回溯 4分支限界 5遗传算法-0-1 knapsack problem greedy algorithm five Solution 1 2 3 back in 4 dynamic programming genetic algorithm branch and bound 5
geosteiner-3.1.tar
- A classic Steiner tree constructor based on branch-and-bound with the most close-to-optimum solution quality
n_queen
- 还是用分支限界法解N皇后问题，已成功运行过。-Using branch and bound Solving N Queens, which has been run successfully over
MIP
- 运用分支定界法求解混合整数线性规划，可用于求解电力系统机组组合问题- solving mixed integer linear programming branch and bound method ,and the program can solve unit commitment problem
背包问题用lc分支限界方法
- 01背包问题，用lc分支限界方法，做的ppt-01 knapsack problem, using lc branch and bound method, do ppt
55
- 背包问题分枝界限算法的源代码 其中包括背包容量、下限、剩余容量、当前价值之和 等-Branch-and-bound algorithm for knapsack problem of the source code including backpack capacity, the lower limit, the remaining capacity, the current value and so on
branchandbound
- 分支限界这一章的课件，经典空间，大家交流呀-Branch and bound this chapter courseware, classic space, we exchange it
fenzhidingjieMATLAB
- 分枝定界法求解整数规划的MATLAB实现-Branch and Bound Method for Solving Integer Programming MATLAB to achieve
bag
- 分支限界法解决0/1背包问题，用c++的优先队列方法-Branch and bound method to solve 0/1 knapsack problem, using c++ Priority queue method
che
- 问题描述：按照国际象棋的规则，车可以攻击与之处在同一行或同一列上的棋子。指南车是有方向的车。横向指南车可以攻击与之处在同一行上的棋子。纵向指南车可以攻击与之处在同一列上的棋子。指南车问题要求在m×n格的棋盘上放置指南车，并确定各指南车的攻击方向，使棋盘上不受指南车攻击的方格数最多。 编程任务：对于给定的m×n格的棋盘和2 个整数x 和y。整数x 表示棋盘上有x个规定方格应放置指南车，但攻击方向未定。整数y表示除了已规定放置位置的x个指南车外，还要在棋盘上放置y个指南车，其位置和攻击方向
NN_V1.1
- 使用R-tree和分支限界方法解决N维NN问题，带报告。带数据生成器和R-TREE模板。-The use of R-tree and branch and bound method to solve N-dimensional NN problem with the report. With the data generator and R-TREE template.
TSP_branch_and_bound_method
- 用来解决旅行商问题 可以直接运行 很好的代码-Used to solve the traveling salesman problem can be directly run a very good code
BNBGUI
- 分支定界算法的GUI版 用来解整数规划问题 相当方便-Branch and bound algorithm for the solution of the GUI version of integer programming problem Convenience ~ ~ ~
distinguish-from
- 讲述了模式识别中特征的提取和特征的转化，及对分支定界的鉴戒-Pattern recognition on the extraction of features and characteristics of the transformation, and the warning of the branch and bound
The_design_of_computer_algorithms
- 全书从算法设计和算法分析的基本概念和方法入手，系统介绍了算法设计方法与分析技巧。全书分为3个部分：第一部分介绍算法的基本概念、算法的数学基础以及算法复杂度分析；第二部分针对排序问题和图的问题，讨论各种已有的算法，并介绍常用的算法设计方法包括分治法、贪心法、动态规划法、回溯法和分支限界法，并介绍了计算的复杂性以及NP完全问题；第三部分讲述并行计算模型和并行算法设计技术。书中每章后面都附有一定数量的习题，帮助读者理解和掌握书中的内容。-Book from the algorithm design a
fenzhixianjie
- 算法分析中，分支限界法的实现，并有完整的测试数据-Algorithm analysis, the achievement of branch and bound method, as well as complete test data
Nhuanghoujianzhi
- N皇后剪枝算法 关键字 回溯，剪枝 ，上界，下界，分支限界-N Queen pruning algorithm for keyword back, pruning, upper bound, lower bound, branch and bound